Balanced tableaux

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

HyperS Tableaux - Heuristic Hyper Tableaux

Several syntactic methods have been constructed to automate theorem proving in first-order logic. The positive (negative) hyper-resolution and the clause tableaux were combined in a single calculus called hyper tableaux in [1]. In this paper we propose a new calculus called hyperS tableaux which overcomes substantial drawbacks of hyper tableaux. Contrast to hyper tableaux, hyperS tableaux are e...

متن کامل

Bipieri tableaux

We introduce a new class of combinatorial objects, which we call “bipieri tableaux,” which arise in a natural way from the evaluation of products consisting of commutative or noncommutative complete homogeneous symmetric functions and elementary symmetric functions through repeated applications of Pieri rules. We prove using sign-reversing involutions on bipieri tableaux an elegant coproduct fo...

متن کامل

Temporalising Tableaux

Roman Kontchakov, Carsten Lutz, Frank Wolter, and Michael Zakharyaschev Department of Computer Science, King’s College, Strand, London WC2R 2LS, U.K. LuFG Theoretical Computer Science RWTH Aachen, Ahornstr. 55, 52074 Aachen, Germany. Institut für Informatik, Universität Leipzig Augustus-Platz 10-11, 04109 Leipzig, Germany. (e-mails: {romanvk,mz}@dcs.kcl.ac.uk, [email protected], wolter@inf...

متن کامل

Hyper Tableaux

This paper introduces a variant of clausal normal form tableaux that we call “hyper tableaux”. Hyper tableaux keep many desirable features of analytic tableaux while taking advantage of the central idea from (positive) hyper resolution, namely to resolve away all negative literals of a clause in a single inference step. Another feature of the proposed calculus is the extensive use of universall...

متن کامل

Young tableaux

This paper gives a qualitative description how Young tableaux can be used to perform a Clebsch-Gordan decomposition of tensor products in SU(3) and how this can be generalized to SU(N).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Mathematics

سال: 1987

ISSN: 0001-8708

DOI: 10.1016/0001-8708(87)90063-6